Extremal Graphs for Intersecting Triangles
نویسندگان
چکیده
منابع مشابه
Extremal Graphs for Intersecting Triangles
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex. 1 Notation With integers n ≥ p ≥ 1, we let Tn,p denote the Turán graph, i.e., the complete p-partite graph on n vertices where each partite set...
متن کاملExtremal graphs for intersecting cliques
For any two positive integers nXrX1; the well-known Turán Theorem states that there exists a least positive integer exðn;KrÞ such that every graph with n vertices and exðn;KrÞ þ 1 edges contains a subgraph isomorphic to Kr: We determine the minimum number of edges sufficient for the existence of k cliques with r vertices each intersecting in exactly one common vertex. r 2003 Elsevier Science (U...
متن کاملExtremal Graph for Intersecting Odd Cycles
An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...
متن کاملEppstein's bound on intersecting triangles revisited
Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Ω(m/(n log n)) triangles of T . Eppstein (1993) gave a proof of this claim, but there is a problem with his proof. Here we provide a correct proof by slightly modifying Eppstein’s argument.
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1995
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1026